منابع مشابه
Using Augmented Reality for Visualizing Complex Graphs in Three Dimensions
In this paper we explore the effect of using Augmented Reality for three-dimensional graph link analysis. Two experiments were conducted. The first was designed to compare a tangible AR interface to a desktop-based interface. Different modes of viewing network graphs were presented using a variety of interfaces. The results of the first experiment lend evidence to the view that a tangible AR in...
متن کاملVisualizing object oriented software in three dimensions
There is increasing evidence that it is possible to perceive and understand increasingly complex information systems if they are displayed as graphical objects in a three dimensional space. Object-oriented software provides an interesting test case there is a natural mapping from software objects to visual objects. In this paper we explore two areas. 1) Information perception: we are running co...
متن کاملOn algebraically defined graphs in three dimensions
Let F be a field of characteristic zero or of a positive odd characteristic p. For a polynomial f ∈ F[x, y], we define a graph ΓF(xy, f) to be a bipartite graph with vertex partition P ∪L, P = F = L, and (p1, p2, p3) ∈ P is adjacent to [l1, l2, l3] ∈ L if and only if p2 + l2 = p1l1 and p3 + l3 = f(p1, l1). If f = xy, the graph ΓF(xy, xy ) has the length of a shortest cycle (the girth) equal to ...
متن کاملDrawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a divide and conquer approach. More specifically, it draws each cluster in a 2D plane to minimise occlusion and ease navigation. Then a 3D drawing of the whole graph is constructed by combining these 2D drawings. Our ma...
متن کاملDrawing Graphs Symmetrically in Three Dimensions
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Applied Perception
سال: 2008
ISSN: 1544-3558,1544-3965
DOI: 10.1145/1279640.1279642